Finite-Length Scaling of Spatially Coupled LDPC Codes Under Window Decoding Over the BEC
نویسندگان
چکیده
منابع مشابه
Notes: Finite-length Protograph-based Spatially Coupled LDPC Codes
The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes is analyzed over the binary erasure channel (BEC). Existing scaling laws are extended to arbitrary protograph base matrices including puncturing patterns and multiple edges between nodes. Compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-...
متن کاملML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms
The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density paritycheck (LDPC) codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is computed by using a recurrent procedure and compared to the empirically found average spectrum for the same ensemble as well as to the empirical average spectrum...
متن کاملImproving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains
In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting shor...
متن کاملML and Near-ML Decoding Performance of LDPC Codes over BEC: Bounds and Decoding Algorithms
Performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite length LDPC codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is computed by using a recurrent procedure and compared to the empirically found average spectrum for the same ensemble as well as to the empirical average spectrum of the Richardson-Urbanke ens...
متن کاملHybrid Decoding of Finite Geometry LDPC Codes
For finite geometry low-density parity-check codes, heavy row and column weights in their parity check matrix make the decoding with even Min-Sum (MS) variants computationally expensive. To alleviate it, we present a class of hybrid schemes by concatenating a parallel bit flipping (BF) variant with an Min-Sum (MS) variant. In most SNR region of interest, without compromising performance or conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2020
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2020.3010958